Polynomial and abstract subrecursive classes
نویسندگان
چکیده
منابع مشابه
Polynomial-Time formula classes
So far the only method we have to solve the propositional satisfiability problem is to use truth tables, which takes exponential time in the formula size in the worst case. In this lecture we show that for Horn formulas and 2-CNF formulas satisfiability can be decided in polynomial time, whereas for 3-CNF formulas satisfiability is as hard as the general case. We also show that if we replace di...
متن کاملCharacterizing polynomial and exponential complexity classes in elementary lambda-calculus (abstract)
This paper fits in the research line of implicit computational complexity (ICC), whose goal is to characterize complexity classes without relying on explicit bounds on resources but instead by considering restrictions on programming languages and calculi. One can distinguish in this body of work between some monovalent characterisations, which provide a language for one given complexity class, ...
متن کاملSorting classes – Extended Abstract
Weak and strong sorting classes are pattern-closed classes that are also closed downwards under the weak and strong orders on permutations. They are studied using partial orders that capture both the subpermutation order and the weak or strong order. In both cases they can be characterised by forbidden permutations in the appropriate order. The connection with the corresponding forbidden permut...
متن کاملQuasiminimal abstract elementary classes
We propose the notion of a quasiminimal abstract elementary class (AEC). This is an AEC satisfying four semantic conditions: countable Löwenheim-Skolem-Tarski number, existence of a prime model, closure under intersections, and uniqueness of the generic orbital type over every countable model. We exhibit a correspondence between Zilber’s quasiminimal pregeometry classes and quasiminimal AECs: a...
متن کاملPolynomial Certificates for Propositional Classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding the number of queries that are required to learn the class ignoring computational complexity. This quantity is known to be captured by a combinatorial measure of concept classes known as the certificate complexity. The p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1976
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(76)80035-9